Numerical aspects of the sweeping process

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Order of a Numerical Scheme for Sweeping Process

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

Numerical scheme for a whole class of sweeping process

2 Mathematical framework and well-posedness results 4 2.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Uniform prox-regularity of sets Q(t) . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Lipschitz regularity of Q . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.4 Well-posedness results . . . . . . . . . . . . . . . ....

متن کامل

Higher order Moreau's sweeping process: mathematical formulation and numerical simulation

In this paper we present an extension of Moreau’s sweeping process for higher order systems. The dynamical framework is carefully introduced, qualitative, dissipativity, stability, existence, regularity and uniqueness results are given. The time-discretization of these nonsmooth systems with a timestepping algorithm is also presented. This differential inclusion can be seen as a mathematical fo...

متن کامل

Trajectory length of the tame sweeping process

We show that bounded trajectories of the semi-algebraic, or more generally o-minimally definable, sweeping process have finite length. This result generalizes previous work on gradient/subgradient dynamical systems and paves the way for further extensions in control systems and mathematical mechanics.

متن کامل

Sweeping by a tame process

We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering

سال: 1999

ISSN: 0045-7825

DOI: 10.1016/s0045-7825(98)00387-9